Uniform Kurtz randomness
نویسندگان
چکیده
We propose studying uniform Kurtz randomness, which is the uniform relativization of Kurtz randomness. This notion has more natural properties than the usual relativization. For instance, van Lambalgen’s theorem holds for uniform Kurtz randomness while not for (the usual relativization of) Kurtz randomness. Another advantage is that lowness for uniform Kurtz randomness has many characterizations, such as those via complexity, martingales, Kurtz tt-traceability, and Kurtz dimensional measure.
منابع مشابه
Lowness for uniform Kurtz randomness
We propose studying uniform Kurtz randomness, which is the uniform relativization of Kurtz randomness. One advantage of this notion is that lowness for uniform Kurtz randomness has many characterizations, such as those via complexity, martingales, Kurtz tt-traceability, and Kurtz dimensional measure.
متن کاملNull-additivity in the Theory of Algorithmic Randomness
In this paper, we develop a general framework integrating algorithmic and higher randomness theories. We clarify the relationship of the notions of triviality and uniform-lowness in algorithmic randomness theory and null-additivity in set theory by effectivizing combinatorial characterizations of transitive additivity in set theory of the real line. For instance, we show that the following thre...
متن کاملUniform distribution and algorithmic randomness
Abstract. A seminal theorem due to Weyl [14] states that if (an) is any sequence of distinct integers, then, for almost every x ∈ R, the sequence (anx) is uniformly distributed modulo one. In particular, for almost every x in the unit interval, the sequence (anx) is uniformly distributed modulo one for every computable sequence (an) of distinct integers. Call such an x UD random. Here it is sho...
متن کاملHigher Kurtz randomness
A real x is ∆1-Kurtz random (Π 1 1-Kurtz random) if it is in no closed null ∆1 set (Π 1 1 set). We show that there is a cone of Π 1 1-Kurtz random hyperdegrees. We characterize lowness for ∆1-Kurtz randomness as being ∆ 1 1-dominated and ∆ 1 1semi-traceable.
متن کاملLowness for Kurtz randomness
We prove that degrees that are low for Kurtz randomness cannot be diagonally non-recursive. Together with the work of Stephan and Yu [16], this proves that they coincide with the hyperimmune-free non-DNR degrees, which are also exactly the degrees that are low for weak 1-genericity. We also consider Low(M, Kurtz), the class of degrees a such that every element of M is a-Kurtz random. These are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Comput.
دوره 24 شماره
صفحات -
تاریخ انتشار 2014